The nature and power of fixed-point logic with counting
نویسندگان
چکیده
منابع مشابه
On Fixed-Point Logic With Counting
One of the fundamental results of descriptive complexity theory, due to Immerman [12] and Vardi [17], says that a class of ordered finite structures is definable in fixed-point logic if, and only if, it is computable in polynomial time. Much effort has been spent on the problem of capturing polynomial time, that is, describing all polynomial time computable classes of not necessarily ordered fi...
متن کاملOn the Expressive Power of Monadic Least Fixed Point Logic
Monadic least fixed point logic MLFP is a natural logic whose expressiveness lies between that of first-order logic FO and monadic second-order logic MSO. In this paper we take a closer look at the expressive power of MLFP. Our results are (1) MLFP can describe graph properties beyond any fixed level of the monadic secondorder quantifier alternation hierarchy. (2) On strings with built-in addit...
متن کاملthe evaluation of language related engagment and task related engagment with the purpose of investigating the effect of metatalk and task typology
abstract while task-based instruction is considered as the most effective way to learn a language in the related literature, it is oversimplified on various grounds. different variables may affect how students are engaged with not only the language but also with the task itself. the present study was conducted to investigate language and task related engagement on the basis of the task typolog...
15 صفحه اولInclusion Logic and Fixed Point Logic
We investigate the properties of Inclusion Logic, that is, First Order Logic with Team Semantics extended with inclusion dependencies. We prove that Inclusion Logic is equivalent to Greatest Fixed Point Logic, and we prove that all union-closed first-order definable properties of relations are definable in it. We also provide an EhrenfeuchtFräıssé game for Inclusion Logic, and give an example i...
متن کاملExistential Fixed-Point Logic
The purpose of this paper is to draw attention to existential fixed-point logic. Among other things, we show that: (1) If a structure A satisfies an existential fixed-point formula φ, then A has a finite subset F such that every structure B with A |F = B |F satisfies φ. (2) Using existential fixed-point logic instead of first-order logic removes the expressivity hypothesis in Cook's completenes...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: ACM SIGLOG News
سال: 2015
ISSN: 2372-3491
DOI: 10.1145/2728816.2728820